An approximate single-loop chaos control method for reliability based design optimization using conjugate gradient search directions

نویسندگان

چکیده

Single-loop methods based on the Karush–Kuhn–Tucker conditions are considered to be efficient reliability design optimization (RBDO) methods. The probabilistic performance functions converted deterministic for reducing computational burden of analysis. However, most probable target point (MPTP) estimated using steepest descent search directions diverges or oscillates highly nonlinear functions. Therefore, an approximate single-loop chaos control method is proposed address this challenge by estimating MPTP conjugate gradient directions. An oscillation criterion also track in every iteration. When satisfied, theory used update current MPTP. tested six mathematical and two engineering RBDO examples from literature. Monte Carlo simulations performed obtained solutions their reliability. results demonstrate that generates best reliable solution computationally chosen set over seven

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-Loop System Reliability Based Design Optimization (SRBDO) Using Matrix-based System Reliability (MSR) Method

This paper proposes a single-loop system reliability based design optimization (SRBDO) approach using the recently developed matrix-based system reliability (MSR) method. A single-loop method was employed to eliminate the inner loop of SRBDO that evaluates probabilistic constraints. The MSR method computes the system failure probability and its parameter sensitivities efficiently and accurately...

متن کامل

An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems

In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...

متن کامل

A conjugate gradient based method for Decision Neural Network training

Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...

متن کامل

Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization

Conjugate gradient methods have been paid attention to, because they can be directly applied to large-scale unconstrained optimization problems. In order to incorporate second order information of the objective function into conjugate gradient methods, Dai and Liao (2001) proposed a conjugate gradient method based on the secant condition. However, their method does not necessarily generate a de...

متن کامل

A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems

In this paper‎, ‎two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS})‎ ‎conjugate gradient method are presented to solve unconstrained optimization problems‎. ‎A remarkable property of the proposed methods is that the search direction always satisfies‎ ‎the sufficient descent condition independent of line search method‎, ‎based on eigenvalue analysis‎. ‎The globa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering Optimization

سال: 2021

ISSN: ['1029-0273', '0305-215X', '1026-745X']

DOI: https://doi.org/10.1080/0305215x.2021.2007242